CPO models for compact GSOS languagesACETO, L; INGOLFSDOTTIR, A.Information and computation (Print). 1996, Vol 129, Num 2, pp 107-141, issn 0890-5401Article

Elementary formal systems, intrinsic complexity, and procrastinationJAIN, S; SHARMA, A.Information and computation (Print). 1997, Vol 132, Num 1, pp 65-84, issn 0890-5401Article

Apprenabilité de Classes de Concepts Structurés = On the Learnability of Structural Concept ClassesJappy, Pascal; Gascuel, Olivier.1997, 114 p.Thesis

Compactness and learning of classes of unions of erasing regular pattern languagesUEMURA, Jin; SATO, Masako.Lecture notes in computer science. 2002, pp 293-307, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

Inferring unions of the pattern languages by the most fitting coversYEN KAOW NG; SHINOHARA, Takeshi.Lecture notes in computer science. 2005, pp 269-282, issn 0302-9743, isbn 3-540-29242-X, 1Vol, 14 p.Conference Paper

Succinct circuit representations and leaf language classes are basically the same conceptBORCHERT, B; LOZANO, A.Information processing letters. 1996, Vol 59, Num 4, pp 211-215, issn 0020-0190Article

Conjunctive grammars and alternating pushdown automataAIZIKOWITZ, Tamar; KAMINSKI, Michael.Acta informatica. 2013, Vol 50, Num 3, pp 175-197, issn 0001-5903, 23 p.Article

Learnable classes of general combinatory grammarsMOREAU, Erwan.Lecture notes in computer science. 2005, pp 189-204, issn 0302-9743, isbn 3-540-25783-7, 16 p.Conference Paper

On the inclusion problem for finitely ambiguous rational trace languagesBERTONI, A; MASSAZZA, P.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 79-98, issn 0988-3754Article

Type class directivesHEEREN, Bastiaan; HAGE, Jurriaan.Lecture notes in computer science. 2005, pp 253-267, issn 0302-9743, isbn 3-540-24362-3, 15 p.Conference Paper

The linear landscape of external contextual languagesEHRENFEUCHT, A; PAUN, G; ROZENBERG, G et al.Acta informatica. 1996, Vol 33, Num 6, pp 571-593, issn 0001-5903Article

The generating power of boundary NLC graph grammars and cycle graphsYAMAZAKI, K.Information sciences. 1994, Vol 80, Num 1-2, pp 133-148, issn 0020-0255Article

Nesting of shuffle closure is importantJEDRZEJOWICZ, J.Information processing letters. 1987, Vol 25, Num 6, pp 363-367, issn 0020-0190Article

On three-way two-dimensional multicounter automataSZEPIETOWSKI, A.Information sciences. 1991, Vol 55, Num 1-3, pp 35-47, issn 0020-0255, 13 p.Article

On the varieties of languages associated with some varieties of finite monoids with commuting indempotentsASH, C. J; HALL, T. E; PIN, J. E et al.Information and computation (Print). 1990, Vol 86, Num 1, pp 32-42, issn 0890-5401, 11 p.Article

Unbounded Petri net synthesisDARONDEAU, Philippe.Lectures on concurrency and Petri nets : advances in Petri nets. Lecture notes in computer science. 2004, pp 413-438, issn 0302-9743, isbn 3-540-22261-8, 26 p.Book Chapter

On pseudovarieties of semiring homomorphismsPOLAK, Libor.Lecture notes in computer science. 2004, pp 635-647, issn 0302-9743, isbn 3-540-22823-3, 13 p.Conference Paper

On free inverse monoid languagesSILVA, P. V.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 4, pp 349-378, issn 0988-3754Article

Primitive 2-structures with the (n-2)-propertyBONIZZONI, P.Theoretical computer science. 1994, Vol 132, Num 1-2, pp 151-178, issn 0304-3975Article

On the expressive power of finitely typed and universally polymorphic recursive proceduresKFOURY, A. J; TIURYN, J; URZYCZYN, P et al.Theoretical computer science. 1992, Vol 93, Num 1, pp 1-41, issn 0304-3975Article

On tally relativizations of BP-complexity classesSHOUWEN TANG; WATANABE, O.SIAM journal on computing (Print). 1989, Vol 18, Num 3, pp 449-462, issn 0097-5397Article

Learning Analysis by Reduction from Positive DataMRAZ, Frantisek; OTTO, Friedrich; PLATEK, Martin et al.Lecture notes in computer science. 2006, pp 125-136, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 12 p.Conference Paper

Foundations for the run-time monitoring of reactive systems : Fundamentals of the MaC languageVISWANATHAN, Mahesh; KIM, Moonzoo.Lecture notes in computer science. 2005, pp 543-556, issn 0302-9743, isbn 3-540-25304-1, 14 p.Conference Paper

Class-based versus object-based: A denotational comparisonREUS, Bernhard.Lecture notes in computer science. 2002, pp 473-488, issn 0302-9743, isbn 3-540-44144-1, 16 p.Conference Paper

Some classes of regular languages identifiable in the limit from positive dataDENIAL, Francois; LEMAY, Aurélien; TERLUTTE, Alain et al.Lecture notes in computer science. 2002, pp 63-76, issn 0302-9743, isbn 3-540-44239-1, 14 p.Conference Paper